Multilingual novelty detection.

MODA automated test generation for database applications via mock objects.

A note on the solution of fuzzy linear systems.

Optimal Resource Allocation for Video Delivery over MIMO OFDM Wireless Systems.

The classification of spatial features on cognitive psychological model.

The relationship between urban travelers%27 personal attributes and propensity to utilize Pre%2Dtrip Traveler Information System.

Assigning geographical focus to documents.

An evidence%2Dbased approach for Toponym Disambiguation.

Heat value identification of coal in utility boilers with neural network.

Simulation of the single channel dual%2Dspectrum low light level instrument.

Action Recognition by Multiple Features and Hyper%2DSphere Multi%2Dclass SVM.

Evaluation of security algorithms that combat Byzantine failures in Cognitive Radio Networks.

Do Wikipedians follow domain experts%3F a domain%2Dspecific study on Wikipedia knowledge building.



Convergence of trajectories and optimal buffer sizing for MIMD congestion control.
congestion control
A point%2Dset%2Dbased approximation for areal objects A case study of representing localities.

Pattern matching with wildcards using words of shorter length.

A faster algorithm for matching a set of patterns with variable length don%27t cares.

A Solution of Data Inconsistencies in Data Integration %2D Designed for Pervasive Computing Environment.

Unusual event detection and prediction based on sectional contextual edit distance.

A Scalable Approach to Analyzing Network Security using Compact Attack Graphs.

Local albedo%2Dinsensitive single image dehazing.

A Custom%2DContoured Cushion for Preventing Pressure Ulcers.

Design of Intelligent Hydraulic Excavator Control System Based on PID Method.

CropIrri A Decision Support System for Crop Irrigation Management.

Actuator fault detection and diagnosis based on morphology%2Dwavelet.

Actuator fault detection and diagnosis based on morphology%2Dwavelet.



Research on Urban Traffic and Dynamic Revolution Based on Visualized Model.

Automatic Generation Method of Assembly Tolerance in Large%2DScale Assembly Design.

Chinese Novelty Mining.

Research on the Changes in Lake Wetland in Hubei Province.

A Scalable Approach to Full Attack Graphs Generation.

On the Structure of Consistent Partitions of Substring Set of a Word.

Transmission Investment Decision Based on Fuzzy Real Options Method under Uncertain Environment.

Interacting with Digital Signage Using Hand Gestures.

Transfer Function Design Using Acting Force Model.

Finite Element Analysis Based Infrared Feature Analysis and Simulation of Ground Target.

Non%2Dinvasive Assessment of Fish Freshness with Bio%2Dimpedance and BP%2DANN Method.

Artificial Immune Principle Based Charging Optimization Algorithm for Refined Copper Strip Producing.

Urban Road Network Modeling and Real%2DTime Prediction Based on Householder Transformation and Adjacent Vector.

A Multi%2Dconstrained Routing Algorithm Based on Mobile Agent for MANET Networks.

An Improved Model of Administrative Decision%2Dmaking Support System Based on MAS.

Optimization of Intelligent Compactness Control Rule of Vibratory Roller Based on Genetic Algorithm Method.

Growth and characterization of PZT thin films with A Pt%2FTi layer on silicon substrate.

The Stable Conditions of a Task%2DPair with Helper%2DThread in CMP.

A Reputation Model Based on Behavior Trust in Wireless Sensor Networks.

Quantization Errors of fGn and fBm Signals

A note on %22The integrable KdV6 equation Multiple soliton solutions and multiple singular soliton solutions%22.
For a class of quasilinear SchrSdinger equations we establish the existence of ground states  of soliton type solutions by a minimization argument.
multiplierz an extensible API based desktop environment for proteomics data analysis.

Quantization Errors of fGn and fBm Signals



Exact Solutions and their Dynamics of Traveling Waves in Three Typical Nonlinear Wave Equations.

IVS 09 Future Research in Vehicle Vision Systems.

PCA based Hurst exponent estimator for fBm signals under disturbances.

Predicting intrusion goal using dynamic Bayesian network with transfer probability estimation.

Security bootstrap model of key pre%2Dsharing by polynomial group in mobile Ad Hoc Network.

Key Management and Authentication in Ad Hoc Network based on Mobile Agent.

Non%2Drigid object tracking in complex scenes.

Proceedings of the 17th ACM Conference on Information and Knowledge Management
RESEARCH INTERESTS I am generally interested in data mining, data warehousing and database systems. My current research focuses on modeling, managing and analyzing large-scale graph and information network data.
Topology Design of Hierarchical Hybrid Fiber%2DVDSL Access Networks with Enhanced Discrete Binary PSO.

Multi%2Dstep 3D%2F2D Image Registration for Image%2Dguided Spinal Surgery.

Lower Extremity Exoskeleton Control and Stability Analysis Based on Virtual Prototyping Technique.

A Grid Middleware DISQ for Data Integration.

Research on Simulation of Multicast Protocol.

Capacity%2DAware Mechanisms for Service Overlay Design.

Multi%2Dradar Tracking based on Weighted k%2Dmeans Clustering Fusion.

Concurrent design for ultra%2Dprecision vibration isolation platform.

An Application of Wavelet Networks in the Carrying Robot Walking.

Hierarchical Reasoning Model of Tolerance Information and Its Using in Reasoning Technique of Geometric Tolerance Types.

Automata for Weak Factor Recognition.

An Application of Wavelet Networks in the Carrying Robot Walking.

Learning from multi%2Dtopic web documents for contextual advertisement.
Contextual advertising on web pages has become very popular recently and it poses its own set of unique text mining challenges. Often advertisers wish to either target (or avoid) some specific content on web pages which may appear only in a small part of the page. Learning for these targeting tasks is difficult since most training pages are multi-topic and need expensive human labeling at the sub-document level for accurate training. In this paper we investigate ways to learn for sub-document classification when only page level labels are available- these labels only indicate if the relevant content exists in the given page or not. We propose the application of multiple-instance learning to this task to improve the effectiveness of traditional methods. We apply sub-document classification to two different problems in contextual advertising. One is “sensitive content detection” where the advertiser wants to avoid content relating to war, violence, pornography, etc. even if they occur only in a small part of a page. The second problem involves opinion mining from review sites- the advertiser wants to detect and avoid negative opinion about their product when positive, negative and neutral sentiments co-exist on a page. In both these scenarios we present experimental results to show that our proposed system is able to get good block level labeling for free and improve the performance of traditional learning methods.
A Novel Energy Efficient Wireless Sensor MAC Protocol.

A Scheme of Detecting Cheaters Wholly in Threshold Secret Sharing for Mobile Ad Hoc Networks.

A New Secure E%2Dmail Scheme Based on Elliptic Curve Cryptography Combined Public Key.

Sensors Fault Detection and Diagnosis Based On Morphology%2Dwavelet Algorithm.



High Quality Factor Silicon Cantilever Driven by PZT Actuator for Resonant Based Mass Detection

GNet A generalized network model and its applications in qualitative spatial reasoning.

Design and fabrication of in%2Dplane resonant microcantilevers.

GISSD Group I Intron Sequence and Structure Database.

An Improved Ant Colony Optimization Algorithm Based on Route Optimization and Its Applications in Travelling Salesman Problem.

Heat Loss Through Covering Layer.

Research and Analysis of Ajax Technology Effect on Information System Operating Efficiency.

A Pupil Localization Algorithm Based on Adaptive Gabor Filtering and Negative Radial Symmetry.

Robust Children and Adults Speech Classification.

Error Report Driven Post%2DMortem Analysis.

Multiscale Linear Feature Detection in Noisy Image Based on Beamlet.

Simultaneously Prediction of Network Traffic Flow Based on PCA%2DSVR.

A 8b 10Ms%2Fs Low Power Pipelined A%2FD Converter.

Truthful Resource Allocation in Selfish Sensor Web.

Optimal reinsurance under the general mixture risk measures.

The Progress of University Digital Museum Grid.

Input%2DOutput Decoupling of Affine Nonlinear Descriptor Control Systems.

Fast Visualization Algorithm for Implicit Surfaces.

Fusion Image Quality Appraisal Method of Dual%2Dspectrum Night Vision Technology.

A Markov Random Field Based Hybrid Algorithm with Simulated Annealing and Genetic Algorithm for Image Segmentation.

A Novel Unified SPM%2DICA%2DPCA Method for Detecting Epileptic Activities in Resting%2DState fMRI.

Using Abstraction%2Ddriven Slicing for Postmortem Analysis of Software.


Study of Shipboard Power System Intelligent Network Reconfiguration.

PID Control of Nonlinear Motor%2DMechanism Coupling System Using Artificial Neural Network.

Detection for Triangle Traffic Sign Based on Neural Network.

Globally synchronized dead%2Dreckoning with local lag for continuous distributed multiplayer games.




Optimal Traffic%2Dto%2DPilot Power Ratio in CDMA Uplink.

Performance Evaluation and Experiment of a Configuration Algorithm for Three%2DStage Multi%2DGranularity Optical Cross%2DConnects.

A Threshold%2DBased Energy Efficient Routing Protocol for Wireless Sensor Networks.

A Wavefront Parallelisation of CTMC Solution Using MTBDDs.
In this paper, we present a parallel implementation for the steady-state analysis of continuous-time Markov chains (CTMCs). This analysis is performed via solution of a linear equation system, which is carried out using the Gauss-Seidel iterative method. We apply wavefront techniques, which are used to create an efficient parallel execution schedule based on dependencies between subtasks. Our implementation uses symbolic data structures – multi-terminal binary decision diagrams (MTBDDs)  – which provide a compact representation for large, structured CTMCs. MTB-DDs prove to be very well suited to this application; firstly, by providing a significant reduction in inter-processor communication; and secondly, by allowing easy access to task dependency information. We demonstrate the effectiveness of our technique by presenting experimental results from a cluster of 32 nodes which exhibit speedups of between 9.7 and 16.5, comparable with existing parallelisations of similar CTMC analysis techniques. Thanks to the low space complexity and good convergence rate of the Gauss-Seidel method, our implementation represents an excellent candidate for parallel steady-state solution of CTMCs. 1
An %22ageing%22 operator and its use in the highly constrained topological optimization of HVAC system design.
The synthesis of novel heating, ventilating, and air-conditioning (HVAC), system configurations is a mixed-integer, non-linear, highly constrained, multi-modal, optimization problem, with many of the constraints being subject to time-varying boundary conditions on the system operation. It was observed that the highly constrained nature of the problem resulted in the dominance of the search by a single topology. This paper, introduces an new evolutionary algorithm operator that prevents topology dominance by penalizing solutions that have a dominant topology. The operator results in a range of dynamic behavior for the rates of growth in topology dominance. Similarly, the application of the ageing penalty can result in the attenuation of topology dominance, or more severely, the complete removal of a topology from the search. It was also observed that following the penalization of a dominant topology, the search was dynamically re-seeded with both new and previously evaluated topologies. It is concluded that the operator prevents topology dominance and increases the exploratory power of the algorithm. The application of an evolutionary algorithm with ageing to the synthesis of HVAC system configurations resulted in a novel design solution having a 15 % lower energy use than the best of conventional system designs.
Traffic Flow Forecasting Using a Spatio%2Dtemporal Bayesian Network Predictor.

On Mitigating Network Partitioning in Peer%2Dto%2DPeer Massively Multiplayer Games.
Abstract. Recently, peer-to-peer infrastructure has been proposed to support massively multiplayer games in the literature. However, when underlying network partitions due to network outages, the game world will partition into several parallel game worlds and it is difficult and costly to merge them when the network partitions disappear. Existing approaches resort to a centralized server to arbitrate. Aiming at mitigating the effects brought by network partitions, we propose a fully distributed algorithm based on state-stack matching. Our theoretical analysis and numerical results show that our approach can resolve the merging issue at the least loss of game states with high probability. 1
Survey of Parallel and Distributed Volume Rendering Revisited.

CRM Systems Used for Targeting Market A Case at Cisco Systems.

Reducing code size in VLIW instruction scheduling.
Code size is an important concern in embedded systems. VLIW architectures are popular for embedded systems, but often increase code size, by requiring NOPs to be inserted into the code to satisfy instruction placement constraints. Existing VLIW instruction schedulers target run-time but not code size. Indeed, current schedulers often increase code size, by generating compensation copies of instructions when moving them across basic block boundaries. Our approach, for the first time, uses the power of scheduling instructions across blocks to reduce code size and not just runtime, for a certain class of VLIWs. We therefore show that trace scheduling, previously synonymous with increased code size, can in fact be used to reduce code size on such VLIWs. Our scheduler uses a cost-model driven, back-tracking approach that starts with an optimal algorithm for searching the solution space in exponential time, but then also employs branch-and-bound techniques and nonoptimal heuristics to keep the compile time reasonable (within a factor of 2). Our method reduces the code size for our benchmarks by 16 % versus the best existing across-block scheduler, while being within 0.8 % of its run-time. 1
Improvements to GALA and dbERGE II databases featuring genomic sequence alignment

A Parallel Volume Splatting Algorithm Based on PC%2DClusters.

Applying Component%2DBased Meta%2Dservice in Liquid Operating System for Pervasive Computing.

FFT Snake A Robust and Efficient Method for the Segmentation of Arbitrarily Shaped Objects in Image Sequences.

FFT Snake A Robust and Efficient Method for the Segmentation of Arbitrarily Shaped Objects in Image Sequences.

Specification for Service Quality Management System of e%2DLearning.

Dual%2DProcessor Parallelisation of Symbolic Probabilistic Model Checking.

OntoSearch An Ontology Search Engine.

Spatial%2Dtemporal traffic data analysis based on global data management using MAS.

Spanning 2%2Dtrails from degree sum conditions.
Journal of Graph Theory c ○ 2004(?) (copyright owner as specified in the Journal)
Execution History Guided Instruction Prefetching.
The increasing gap in performance between processors and main memory has made effective  instructions prefetching techniques more important than ever. A major deficiency of  existing prefetching methods is that most of them require an extra port to I-cache. A recent  study by [19] shows that this factor alone explains why most modern microprocessors do  not use such I-cache hardware-based I-cache prefetch schemes. The contribution of this  paper is two-fold. First we present a method that does not require an extra port to I-cache.
Call Admission Policies Based on Calculated Power Control Setpoints in SIR%2DBased Power%2DControlled DS%2DCDMA Cellular Networks.
Abstract. In this paper, we develop call admission control algorithms for SIR-based power-controlled DS-CDMA cellular networks. We consider networks that handle both voice and data services. When a new call (or a handoff call) arrives at a base station requesting for admission, our algorithms will calculate the desired power control setpoints for the new call and all existing calls. We will provide necessary and sufficient conditions under which the power control algorithm will have a feasible solution. These conditions are obtained through deriving the inverse of the matrix used in the calculation of power control setpoints. If there is no feasible solution to power control or if the desired power levels to be received at the base station for some calls are larger than the maximum allowable power limits, the admission request will be rejected. Otherwise, the admission request will be granted. When higher priority is desired for handoff calls, we will allow different thresholds (i.e., different maximum allowable power limits) for new calls and handoff calls. We will develop an adaptive algorithm that adjusts these thresholds in real-time as environment changes. The performance of our algorithms will be shown through computer simulation and compared with existing algorithms.
Graph%2Dbased ranking algorithms for e%2Dmail expertise analysis.
%=g ()I h)/$7 Z!6 ( i&gt; / &#039;]!6&lt;( %-I j! 4 / (K! &#039;$:
Efficient Density Clustering Method for Spatial Data.

Automatic Text Detection In Video Frames Based on Bootstrap Artificial Neural Network and CED.

Execution history guided instruction prefetching.
The increasing gap in performance between processors and main memory has made effective  instructions prefetching techniques more important than ever. A major deficiency of  existing prefetching methods is that most of them require an extra port to I-cache. A recent  study by [19] shows that this factor alone explains why most modern microprocessors do  not use such I-cache hardware-based I-cache prefetch schemes. The contribution of this  paper is two-fold. First we present a method that does not require an extra port to I-cache.
A highly linear low%2Dvoltage MOS transconductor.

Multimedia Data Mining Using P%2DTrees.
The DataSURG group at NDSU has a long-standing interest in data mining remotely sensed imagery (RSI) for agricultural, forestry and other prediction and analysis applications. A spatial data structure, the Peano count tree, was developed that provided an efficient, lossless, data mining ready representation of the many types of data involved in these applications. This data structure has made possible the mining of multiple very large data sets, including time-sequence of RSI and multimedia land data. The Peano count tree (P-tree) technology provides an efficient way to store and mine images of any format, together with pertinent land data of still other formats.
Performance Adaptation in Real%2DTime Intrusion Detection Systems.

Multimedia Data Mining Using P%2DTrees.
The DataSURG group at NDSU has a long-standing interest in data mining remotely sensed imagery (RSI) for agricultural, forestry and other prediction and analysis applications. A spatial data structure, the Peano count tree, was developed that provided an efficient, lossless, data mining ready representation of the many types of data involved in these applications. This data structure has made possible the mining of multiple very large data sets, including time-sequence of RSI and multimedia land data. The Peano count tree (P-tree) technology provides an efficient way to store and mine images of any format, together with pertinent land data of still other formats.
Pentamidine inhibits catalytic activity of group I intron Ca.LSU by altering RNA folding.

Detection of text captions in compressed domain video.

Entropy%2Dbased Subspace Clustering for Mining Numerical Data.
Mining numerical data is a relatively difficult problem in data mining. Clustering is one of the techniques. We consider a database with numerical attributes, in which each transaction is viewed as a multi-dimensional vector. By studying the clusters formed by these vectors, we can discover certain behaviors hidden in the data. Traditional clustering algorithms find clusters in the full space of the data sets. This results in high dimensional clusters, which are poorly comprehensible to human. One important task in this setting is the ability to discover clusters embedded in the subspaces of a high-dimensional data set. This problem is known as subspace clustering. We follow the basic assumptions of previous work CLIQUE. It is found that the number of subspaces with clustering is very large, and a criterion called the coverage is proposed in CLIQUE for the pruning. In addition to coverage, we identify new useful criteria for this problem and propose an entropybased algorithm called ENC...
Towards a Problem of E. van Douwen and A. Miller.

Robot actuation with low%2Dpressure air%2Dpowered motors.

Translation of Object%2DOriented Queries to Relational Queries.
In this paper, we propose a formal approach for translating OODB queries to equivalent relational queries. The translation is accomplished through the use of the relational predicate graphs and the OODB predicate graphs. One advantage of using such a graph-based approach is that we can achieve bidirectional translation between relational queries and OODB queries. 1 Introduction  Heterogeneous database system techniques [2,8,11,13,14,16] can be used to allow users of one system to access data from different systems with ease. Schema transformers [3,18] and query translators [7,12] are critical components of heterogeneous database systems. Using object-oriented systems as the front-end system has been suggested by [4,13,16]. In this paper, we consider an object-oriented front-end on top of relational database systems. An object-oriented query will be translated to a relational query processable by the underlying system. A mechanism based on the extended OODB predicate graph (OPG) (to be ...
Scheduling policies for a computing system.

